Learning conditionally lexicographic preference relations
نویسندگان
چکیده
We consider the problem of learning a user’s ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general graphical representation called LP-trees which captures various natural classes of such preference relations, depending on whether the importance order between attributes and/or the local preferences on the domain of each attribute is conditional on the values of other attributes. For each class we determine the Vapnik-Chernovenkis dimension, the communication complexity of preference elicitation, and the complexity of identifying a model in the class consistent with a set of user-provided examples.
منابع مشابه
Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains
One approach to voting on several interrelated issues consists in using a language for compact preference representation, from which the voters’ preferences are elicited and aggregated. A language usually comes with a domain restriction. We consider a well-known restriction, namely, conditionally lexicographic preferences, where both the relative importance between issues and the preference bet...
متن کاملLexicographic Combinations of Preference Relations in the Context of Possibilistic Decision Theory
In Possibilistic Decision Theory (PDT), decisions are ranked by a pessimistic or by an optimistic qualitative criteria. The preference relations induced by these criteria have been axiomatized by corresponding sets of rationality postulates, both à la Von Neumann and Morgenstern and à la Savage. In this paper we first address a particular issue regarding the axiomatic systems of PDT à la Von Ne...
متن کاملOperators and Laws for Combining Preference Relations
The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator maps a family of relations to a single relation which represents their lexicographic combination according to a certain priority on the family of relations. We present four kinds of results. We show that the lexicographi...
متن کاملOperators and Laws for Combining
The paper concerns the use of the lexicographic rule for combining preference relations with diierent priorities. We use it to interpret defaults with priorities. We present four kinds of results. We show that the lexicographic rule is the only way of combining preference relations which satisses conditions proposed by Arrow 1. We show in what circumstances the lexicographic rule propagates var...
متن کاملLearning Conditional Lexicographic Preference Trees
We introduce a generalization of lexicographic orders and argue that this generalization constitutes an interesting model class for preference learning in general and ranking in particular. We propose a learning algorithm for inducing a so-called conditional lexicographic preference tree from a given set of training data in the form of pairwise comparisons between objects. Experimentally, we va...
متن کامل